Generalized light robustness and the trade-off between robustness and nominal quality

Robust optimization considers optimization problems with uncertainty in the data. The common data model assumes that the uncertainty can be represented by an uncertainty set. Classic robust optimization considers the solution under the worst case scenario. The resulting solutions are often too conservative, e.g., they have high costs compared to non-robust solutions. This is a reason for the development of less conservative robust models. In this paper we extract the basic idea of the the concept of light robustness originally developed in [FM09] for interval-based uncertainty sets and linear programs: Fix a quality standard for the nominal solution and among all solutions satisfying this standard choose the most reliable one. We then use this idea in order to formulate the concept of light robustness for arbitrary optimization problems and arbitrary uncertainty sets. We call the resulting concept generalized light robustness. We analyze the concept and discuss its relation to other well-known robustness concepts such as strict robustness [BTGN09], reliability [BTN00] or the approach of Bertsimas and Sim [BS04]. We show that the light robust counterpart is computationally tractable for many different types of uncertainty sets, among them polyhedral or ellipsoidal uncertainty sets. We furthermore discuss the trade-off between robustness and nominal quality and show that non-dominated solutions with respect to nominal quality and robustness can be computed by the generalized light robustness approach.